NOR logic

 ( Logic Gates ) 

A NOR gate or a NOT OR gate is a logic gate which gives a positive output only when both inputs are negative.

Like NAND logic, NOR gates are so-called "" that can be combined to form any other kind of logic gate. For example, the first embedded system, the Apollo Guidance Computer, was built exclusively from NOR gates, about 5,600 in total for the later versions. Today, integrated circuits are not constructed exclusively from a single type of gate. Instead, EDA tools are used to convert the description of a logical circuit to a netlist of complex gates () or transistors (full custom approach).

---

NOR A NOR gate is logically an inverted OR gate. It has the following truth table:

Q = A NOR B { class='wikitable' style="text-align:center" align=center	+Truth Table ! Input A !! Input B !! Output Q
1
0
0
0

|}

---

Making other gates by using NOR gates A NOR gate is a universal gate, meaning that any other gate can be represented as a combination of NOR gates.

---

NOT This is made by joining the inputs of a NOR gate. As a NOR gate is equivalent to an OR gate leading to NOT gate, joining the inputs makes the output of the "OR" part of the NOR gate the same as the input, eliminating it from consideration and leaving only the NOT part.

= A NOR A
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Output Q
1
0

|}

---

OR An OR gate is made by inverting the output of a NOR gate. Note that we already know that a NOT gate is equivalent to a NOR gate with its inputs joined.

= ( A NOR B ) NOR ( A NOR B )
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Input B !! Output Q
0
1
1
1

|}

---

AND An AND gate gives a 1 output when both inputs are 1. Therefore, an AND gate is made by inverting the inputs of a NOR gate. Again, note that a NOR gate is equivalent to a NOT with its inputs joined.

= ( A NOR A ) NOR ( B NOR B )
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Input B !! Output Q
0
0
0
1

|}

---

NAND A NAND gate is made by inverting the output of an AND gate. The word NAND means that it is not AND. As the name suggests, it will give 0 when both the inputs are 1.

= NOR
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Input B !! Output Q
1
1
1
0

|}

---

XNOR An XNOR gate is made by connecting four NOR gates as shown below. This construction entails a propagation delay three times that of a single NOR gate.

= NOR
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Input B !! Output Q
1
0
0
1

|}

Alternatively, an XNOR gate is made by considering the conjunctive normal form $(A\; +\; \backslash overline\{B\})\; \backslash cdot\; (\backslash overline\{A\}\; +\; B)$, noting from de Morgan's Law that a NOR gate is an inverted-input AND gate. This construction uses five gates instead of four.

= NOR

---

XOR An XOR gate is made by considering the conjunctive normal form $(A\; +\; B)\; \backslash cdot\; (\; \backslash overline\; A\; +\; \backslash overline\; B\; )$, noting from de Morgan's Law that a NOR gate is an inverted-input OR gate. This construction entails a propagation delay three times that of a single NOR gate and uses five gates.

= NOR ( A NOR B )
{ class="wikitable" style="text-align:center; margin:auto;"	+Truth Table ! Input A !! Input B !! Output Q
0
1
1
0

|}

Alternatively, the 4-gate version of the XNOR gate can be used with an inverter. This construction has a propagation delay four times (instead of three times) that of a single NOR gate.

= { NOR } NOR { NOR }

---

See also

• NAND logic — Like NOR gates, NAND gates are also universal gates.
• Functional completeness

Post Comment